Ping-Pong Protocols as Prefix Grammars and Turchin Relation
نویسنده
چکیده
This paper describes how to verify cryptographic protocols by a general-purpose program transformation technique with unfolding. The questions of representation and analysis of the protocols as prefix rewriting grammars are discussed. In these aspects Higman and Turchin embeddings on computational paths are considered, and a refinement of Turchin’s relation is presented that allows to algorithmically decide the empty word problem for prefix rewriting grammars.
منابع مشابه
Turchin’s Relation and Subsequence Relation on Traces Generated by Prefix Grammars
Turchin’s relation was introduced in 1988 by V. F. Turchin for loop approximation in supercompilation. The paper studies properties of an analogue of the Turchin relation and properties of the subsequence embedding on a restricted set of traces generated by prefix grammars or by a product of prefix grammars.
متن کاملVerification of Multi-Party Ping-Pong Protocols via Program Transformation
The paper describes a verification technique based on program transformation with unfolding. The technique allows to find short attacks on multi-party ping-pong protocols in the Dolev–Yao intruder model. Protocols are modelled by prefix grammars, and questions of model optimization and complexity are considered. Examples of model programs for protocols were written in a functional language and ...
متن کاملMonotonic Set-Extended Prefix Rewriting and Verification of Recursive Ping-Pong Protocols
Ping-pong protocols with recursive definitions of agents, but without any active intruder, are a Turing powerful model. We show that under the environment sensitive semantics (i.e. by adding an active intruder capable of storing all exchanged messages including full analysis and synthesis of messages) some verification problems become decidable. In particular we give an algorithm to decide cont...
متن کاملCitronellyl Butyrate Synthesis in Non-Conventional Media Using Packed-Bed Immobilized Candida Rugosa Lipase Reactor
The synthesis of citronellyl butyrate by direct esterification reaction catalyzed by immobilized lipase from Candida rugosa was studied in a continuous packed bed reactor using n-hexane as organic solvent. Parameters such as residence time, temperature, and pH were examined. The optimum conversion was obtained at a flow rate of 1 ml/min (residence time 8 min), temperature of 50 °C, and pH 7.5. ...
متن کاملOn the Security of Ping-Pong Protocols when Implemented using the RSA
The Security of the RSA implementation of ping-pong protocols is considered. It is shown that the obvious RSA properties, such as "multiplicativity", do not endanger the security of ping-pong protocols. Namely, if a ping-pong protocol is secure in general then its implementation using an "ideal RSA" is also secure.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013